Multiple-entry finite automata

Remarks on Multiple Entry Deterministic Finite Automata

We investigate several aspects of the multiple entry DFA’s. We consider their DFA conversion. Further, we show that they appear as minimal NFA’s for certain classes of languages. Finally, we deal with their decompositions into disjoint unions of automata with fewer states.

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

Finite Automata

• F ⊆ Q is the set of accept or final states. The behavior of a DFA M on an input string x ∈ Σ∗ is as follows. It reads the symbols in x one at a time, from left to right. At each point in time, the automaton has a current state. Initially, the automaton is in state s. If the current state of the automaton is q, and the next symbol in x to be read is a, then the automaton on reading a transitio...

Finite Automata

Finite Automata

Current state and perspectives of development of the theory of timed languages are analyzed. A large list of open problems is suggested. 1 Why study timed systems? In most cases computer science deals with sequences of events or actions (we will call them behaviors). Powerful formalisms have been developed to express sets or trees of such sequences (various automata, grammars, expressions, proc...